package mao.leetcode.offer;

/**
 * @author Totoro
 * @date 2020/8/15
 * @explain:
 */
public class offer65 {

    class Solution {
        public int add(int a, int b) {
            while( b != 0){
                int c = (a & b) << 1;//进位
                a^=b;
                b=c;
            }
            return a;

        }
    }
}
